A Dependency-based Method for Evaluating Broad-Coverage Parsers

نویسنده

  • Dekang Lin
چکیده

A b s t r a c t Wi th th t emergence of broad-coverage parsers, quan­ titative evaluation of parsers becomes increasingly more important We propose a dependency-based method for evaluating broad-coverage parsers The method offers several advantages over previous methods that are based on phrase boundaries The error count score WL propose here is not only more mtui t ivt lv meaningful than other scores but also more relevant lo semantic interpreta­ tion We will also present an algorithm for transform­ ing constituency trees into dependency trees so thai the (.valuation method is applicable to both dependency and constituency grammars Finally we discuss a set of op erations for modifying dependency trees that can be used lo eliminate inconsequential differences among different parse trees and allow us to selectively evaluate different aspects of a parser

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IJCAI - 95 A Dependency - based Method for Evaluating Broad - Coverage

With the emergence of broad-coverage parsers, quantitative evaluation of parsers becomes increasingly more important. We propose a dependency-based method for evaluating broad-coverage parsers. The method ooers several advantages over previous methods that are based on phrase boundaries. The error count score we propose here is not only more intuitively meaningful than other scores, but also mo...

متن کامل

A Two Stage Constraint - Based Dependency Parser for Free Word Order Languages

The paper proposes a broad coverage twostage constraint based dependency parser for free word order languages. For evaluating the parser and to ascertain its coverage we show its performance on Hindi which is a free word order language. We compare our results with that of two data-driven parsers which were trained on a subpart of a Hindi Treebank. The final results are good with a maximum attac...

متن کامل

Alpage: Transition-based Semantic Graph Parsing with Syntactic Features

This paper describes the systems deployed by the ALPAGE team to participate to the SemEval-2014 Task on Broad-Coverage Semantic Dependency Parsing. We developed two transition-based dependency parsers with extended sets of actions to handle non-planar acyclic graphs. For the open track, we worked over two orthogonal axes – lexical and syntactic – in order to provide our models with lexical and ...

متن کامل

Arabic Parsing Using Grammar Transforms

We investigate Arabic Context Free Grammar parsing with dependency annotation comparing lexicalised and unlexicalised parsers. We study how morphosyntactic as well as function tag information percolation in the form of grammar transforms (Johnson, 1998, Kulick et al., 2006) affects the performance of a parser and helps dependency assignment. We focus on the three most frequent functional tags i...

متن کامل

Evaluation of two dependency parsers on biomedical corpus targeted at protein-protein interactions

We present an evaluation of Link Grammar and Connexor Machinese Syntax, two major broad-coverage dependency parsers, on a custom hand-annotated corpus consisting of sentences regarding protein-protein interactions. In the evaluation, we apply the notion of an interaction subgraph, which is the subgraph of a dependency graph expressing a protein-protein interaction. We measure the performance of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Natural Language Engineering

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1995